Optimization of a Quadratic Function under its Canonical Form
نویسندگان
چکیده
منابع مشابه
Computing the $p$-adic Canonical Quadratic Form in Polynomial Time
An n-ary integral quadratic form is a formal expression Q(x1, · · · , xn) = ∑ 1≤i,j≤n aijxixj in nvariables x1, · · · , xn, where aij = aji ∈ Z. We present a randomized polynomial time algorithm that given a quadratic form Q(x1, · · · , xn), a prime p, and a positive integer k outputs a U ∈ GLn(Z/p Z) such that U transforms Q to its p-adic canonical form.
متن کاملA Semidefinite Optimization Approach to Quadratic Fractional Optimization with a Strictly Convex Quadratic Constraint
In this paper we consider a fractional optimization problem that minimizes the ratio of two quadratic functions subject to a strictly convex quadratic constraint. First using the extension of Charnes-Cooper transformation, an equivalent homogenized quadratic reformulation of the problem is given. Then we show that under certain assumptions, it can be solved to global optimality using semidefini...
متن کاملA new quadratic deviation of fuzzy random variable and its application to portfolio optimization
The aim of this paper is to propose a convex risk measure in the framework of fuzzy random theory and verify its advantage over the conventional variance approach. For this purpose, this paper defines the quadratic deviation (QD) of fuzzy random variable as the mathematical expectation of QDs of fuzzy variables. As a result, the new risk criterion essentially describes the variation of a fuzzy ...
متن کاملAn Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function
In this paper, we consider convex quadratic semidefinite optimization problems and provide a primal-dual Interior Point Method (IPM) based on a new kernel function with a trigonometric barrier term. Iteration complexity of the algorithm is analyzed using some easy to check and mild conditions. Although our proposed kernel function is neither a Self-Regular (SR) fun...
متن کاملA Canonical Form for Testing Boolean Function Properties
In a well-known result on graph property testing, [GT03] showed that every testable graph property has a “canonical” testing algorithm in which a set of vertices is selected uniformly at random and the edges queried are the complete graph over the selected vertices. In this paper we define a similar-in-spirit canonical form for Boolean function testing algorithms, and show that under some mild ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Asian Journal of Applied Sciences
سال: 2009
ISSN: 1996-3343
DOI: 10.3923/ajaps.2009.499.510